Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphs
نویسندگان
چکیده
منابع مشابه
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex. We show that the problem is polynomial-time solvable provided that each pr...
متن کاملHomomorphism bounded classes of graphs
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of bounds with special local properties. This gives a new proof of Häggkvist-Hell theorem [5] and implies several cases of the existence of triangle free bounds for planar graphs.
متن کاملComplexity of Locally Injective Homomorphism to the Theta Graphs
A Theta graph is a multigraph which is a union of at least three internally disjoint paths that have the same two distinct end vertices. We show full computational complexity characterization of the problem of deciding the existence of a locally injective homomorphism from an input graph G to any fixed Theta graph.
متن کاملLocally Injective Homomorphism to the Simple Weight Graphs
A Weight graph is a connected (multi)graph with two vertices u and v of degree at least three and other vertices of degree two. Moreover, if any of these two vertices is removed, the remaining graph contains a cycle. A Weight graph is called simple if the degree of u and v is three. We show full computational complexity characterization of the problem of deciding the existence of a locally inje...
متن کاملExact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism
For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2007.06.002